Backward error bounds for 2×2 linear systems arising in the diagonal pivoting method
نویسندگان
چکیده
منابع مشابه
Stability of the Diagonal Pivoting Method with Partial Pivoting
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman [Math. Comp., 31 (1977), pp. 163–179]. No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small....
متن کاملComputable backward error bounds for basic algorithms in linear algebra
Standard error estimates in numerical linear algebra are often of the form γk|R||S| where R,S are known matrices and γk := ku/(1−u) with u denoting the relative rounding error unit. Recently we showed that for a number of standard problems γk can be replaced by ku for any order of computation and without restriction on the dimension. Such problems include LUand Cholesky decomposition, triangula...
متن کاملStability of the Diagonal Pivoting
LAPACK and LINPACK both solve symmetric indeenite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman (1977). No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small. We show that this argument is f...
متن کاملUMIST Stability of the Diagonal Pivoting Method with Partial
LAPACK and LINPACK both solve symmetric inde nite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman (1977). No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small. We show that this argument is f...
متن کاملBackward Error Analysis for Totally Positive Linear Systems
Gauss elimination applied to an n • n matrix ,4 in floating point arithmetic produces (if successful) a factorization /-U which differs from A by no more than ~ ILl ] U I, for some ~ of order n times the unit roundoff. If A is totally positive, then both computed factors /~ and U are nonnegative for sufficiently small unit roundoff and one obtains pleasantly small bounds for the perturbation in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Theory and Its Applications, IEICE
سال: 2015
ISSN: 2185-4106
DOI: 10.1587/nolta.6.383